Bounding the Attractor of an IFS
نویسندگان
چکیده
Fractal images defined by an iterated function system (IFS) are specified by a finite number of contractive affine transformations. In order to plot the attractor of an IFS on the screen of a digital computer, it is necessary to determine a bounding area for the attractor. Given a point on the plane, we obtain a formula for the radius of a circle centred on that point that contains the attractor of the IFS. We then describe an algorithm to find the point on the plane such that the bounding circle centred on that point has minimum radius.
منابع مشابه
Spatial Bounding of Self-Affine Iterated Function System Attractor Sets
An algorithm is presented which, given the parameters of an Iterated Function System (IFS) which uses affine maps, constructs a closed ball which completely contains the attractor set of the IFS. These bounding balls are almost always smaller than those computed by existing methods, and are sometimes much smaller. The algorithm is numerical in form, involving the optimisation of centre-point an...
متن کاملOn the Diameter of the Attractor of an Ifs
We investigate methods for the evaluation of the diameter of the attractor of an IFS. We propose an upper bound for the diameter in n-dimensional space. In the case of an aane IFS, we indicate how this upper bound can be calculated.
متن کاملMathematical framework to show the existence of attractor of partitioned iterative function systems
The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is Partitioned or local Iterative Function System (PIFS) for coding the gray level images. Several techniques of PIFS based image compression have already been proposed by many researchers. The theory of PIFS appears to be different from the theory of IFS in...
متن کاملar X iv : m at h . D S / 07 03 39 8 v 1 1 4 M ar 2 00 7 TRANSFORMATIONS BETWEEN ATTRACTORS OF HYPERBOLIC ITERATED FUNCTION SYSTEMS
This paper is in the form of an essay. It defines fractal tops and code space structures associated with set-attractors of hyperbolic iterated function systems (IFSs). The fractal top of an IFS is associated with a certain shift invariant subspace of code space, whence the entropy of the IFS, and of its set-attractor, may be defined. Given any ordered pair of hyperbolic IFSs, each with the same...
متن کاملBounding Iterated Function Systems via Convex Optimization
We present an algorithm to construct a bounding polyhedron for an affine Iterated Function System (IFS). Our algorithm expresses the IFS-bounding problem as a set of linear constraints on a linear objective function, which can then be solved via standard techniques for linear convex optimization. As such, our algorithm is guaranteed to find the optimum recursively instantiable bounding volume, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 64 شماره
صفحات -
تاریخ انتشار 1997